منابع مشابه
Pairing in Characteristic Three
Since their introduction in constructive cryptographic applications, pairings over (hyper)elliptic curves are at the heart of an ever increasing number of protocols. Software implementations being rather slow, the study of hardware architectures became an active research area. In this paper, we discuss several algorithms to compute the ηT pairing in characteristic three and suggest further impr...
متن کاملCharacteristic Surface Data for the Eikonal Equation
A method of solving the eikonal equation, in either flat or curved space-times, with arbitrary Cauchy data, is extended to the case of data given on a characteristic surface. We find a beautiful relationship between the Cauchy and characteristic data for the same solution, namely they are related by a Legendre transformation. From the resulting solutions, we study and describe the wave-front si...
متن کاملEfficient multiplication in characteristic three fields
Characteristic three fields denoted by F3n , where n ≥ 1, are used in curve based cryptography. In this paper, first we improve the well known Karatsuba 2-way and 3-way algorithms for characteristic three fields. Then, we derive a 3-way polynomial multiplication algorithm with five 1/3 size multiplications using interpolation in F9. After computing the arithmetic and delay complexities of the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1990
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700017937